Untersuchungen zu einer Dualisierung des Rundreiseproblems = On a dualization of the travelling salerman problemJEROMIN, B.Wissenschaftliche Zeitschrift der Technischen Universität Dresden. 1990, Vol 39, Num 1, pp 179-182, issn 0043-6925Conference Paper

Aggregation for the probabilistic traveling salesman problemCAMPBELL, Ann Melissa.Computers & operations research. 2006, Vol 33, Num 9, pp 2703-2724, issn 0305-0548, 22 p.Article

A heuristic circulation-network approach to solve the multi-traveling Salesman problemGARCIA-DIAZ, A.Networks (New York, NY). 1985, Vol 15, Num 4, pp 455-467, issn 0028-3045Article

Traveling-Salesman Problem for a Class of Carrier―Vehicle SystemsGARONE, Emanuele; NALDI, Roberto; CASAVOLA, Alessandro et al.Journal of guidance, control, and dynamics. 2011, Vol 34, Num 4, pp 1272-1276, issn 0731-5090, 5 p.Article

The traveling salesman problemPUNNEN, A.Computers & operations research. 1999, Vol 26, Num 4, issn 0305-0548, 149 p.Serial Issue

The multiple traveling salesman problem : an overview of formulations and solution proceduresBEKTAS, Tolga.Omega (Oxford). 2006, Vol 34, Num 3, pp 209-219, issn 0305-0483, 11 p.Article

When is the assignment bound tight for the asymmetric traveling-salesman problem ?FRIEZE, A; KARP, R. M; REED, B et al.SIAM journal on computing (Print). 1995, Vol 24, Num 3, pp 484-493, issn 0097-5397Article

A new dynamical approach to the travelling Salesman problemBANZHAF, W.Physics letters. A. 1989, Vol 136, Num 1-2, pp 45-51, issn 0375-9601, 7 p.Article

Sur une modification du problème du commis voyageurGERASIMOV, V. A.Avtomatika i telemehanika. 1983, Num 9, pp 161-164, issn 0005-2310Article

Multispectral Air Pollution Sensor to Characterize of Total Suspended Particulates (TSP) ConcentrationDARAIGAN, S. G; MATJAFRI, M. Z; ABDULLAH, K et al.Proceedings of SPIE, the International Society for Optical Engineering. 2009, Vol 7336, issn 0277-786X, isbn 978-0-8194-7602-9 0-8194-7602-1, 1Vol, 73361O.1-73361O.5Conference Paper

Worst-case analysis of some heuristics for the m-Salesmen problemHOON LIONG ONG; MOORE, J. B.Material flow. 1985, Vol 2, Num 1, pp 203-209, issn 0167-1936Article

TRANSFORMATION OF MULTISALESMEN PROBLEM TO THE STANDARD TRAVELING SALESMAN PROBLEM.BELLMORE M; HONG S.1974; J. ASS. COMPUTG MACHIN.; U.S.A.; DA. 1974; VOL. 21; NO 3; PP. 500-504; BIBL. 4 REF.Article

THE CLUSTERED TRAVELING SALESMAN PROBLEM.CHISMAN JA.1975; COMPUTERS OPER. RES.; G.B.; DA. 1975; VOL. 2; NO 2; PP. 115-119; BIBL. 11 REF.Article

SUR UN PROCEDE D'APPROXIMATION DES SOLUTIONS DU PROBLEME DU COMMIS-VOYAGEURMININA TR; PEREKREST VT.1975; DOKL. AKAD. NAUK S.S.S.R.; S.S.S.R.; DA. 1975; VOL. 220; NO 1; PP. 31-34; BIBL. 9 REF.Article

ANALYTISCHER VERGLEICH DER MANUELL-RECHNERISCHEN LOESUNG EINIGER VERFAHREN DES RUNDFAHRTPROBLEMS = COMPARAISON ANALYTIQUE DE DIVERSES METHODES DE RESOLUTION MANUELLE DU PROBLEME DE TOURNEEKNOEFLER KH.1972; HEBEZEUGE FOERDERMITTEL; DTSCH.; DA. 1972; VOL. 12; NO 11; PP. 333-336; ABS. RUSSE ANGL.; BIBL. 9 REF.Serial Issue

CLUSTERING A DATA ARRAY AND THE TRAVELING-SALESMAN PROBLEM.LENSTRA JK.1974; OPER. RES.; U.S.A.; DA. 1974; VOL. 22; NO 2; PP. 413-414; BIBL. 5 REF.Article

ALGORITHMS FOR LARGE-SCALE TRAVELLING SALESMAN PROBLEMSCHRISTOFIDES N; EILON S.1972; OPER. RES. QUART.; G.B.; DA. 1972; VOL. 23; NO 4; PP. 511-518; BIBL. 10 REF.Serial Issue

The general routing polyhedron : A unifying frameworkLETCHFORD, A. N.European journal of operational research. 1999, Vol 112, Num 1, pp 122-133, issn 0377-2217Article

The capacitated traveling salesman problem with pickups and deliveries on a treeLIM, Andrew; FAN WANG; ZHOU XU et al.Lecture notes in computer science. 2005, pp 1061-1070, issn 0302-9743, isbn 3-540-30935-7, 1Vol, 10 p.Conference Paper

A travelling salesman problem in the k-dimensional unit cubeBOLLOBAS, B; MEIR, A.Operations research letters. 1992, Vol 11, Num 1, pp 19-21, issn 0167-6377Article

The facets of the asymmetric S-city traveling salesman polytopeBARTELS, H. G; BARTELS, S. G.Zeitschrift für Operations Research. 1989, Vol 33, Num 3, pp 193-197, issn 0373-790X, 5 p.Article

The travelling salesman problem in graphs with 3 edge cutsetsCORNUEJOLS, G; NADDEF, D; RULLEYBLANK, W et al.Journal of the Association for Computing Machinery. 1985, Vol 32, Num 2, pp 383-410, issn 0004-5411Article

Constrained TSP and low-power computingCHARIKAR, M; MOTWANI, R; RAGHAVAN, P et al.Lecture notes in computer science. 1997, pp 104-115, issn 0302-9743, isbn 3-540-63307-3Conference Paper

A priori bounds of the euclidean traveling salesmanSNYDER, T. L; STEELE, J. M.SIAM journal on computing (Print). 1995, Vol 24, Num 3, pp 665-671, issn 0097-5397Article

Scaling the neural TSP algorithmCUYKENDALL, R; REESE, R.Biological cybernetics. 1989, Vol 60, Num 5, pp 365-371, issn 0340-1200, 7 p.Article